Constructing Infinite Comatrix Corings from Colimits

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Infinite Comatrix Corings from Colimits

We propose a class of infinite comatrix corings, and describe them as colimits of systems of usual comatrix corings. The infinite comatrix corings of El Kaoutit and Gómez Torrecillas are special cases of our construction, which in turn can be considered as a special case of the comatrix corings introduced recently by Gómez Torrecillas an the third author.

متن کامل

On comatrix corings and bimodules

To any bimodule which is finitely generated and projective on one side one can associate a coring, known as a comatrix coring. A new description of comatrix corings in terms of data reminiscent of a Morita context is given. It is also studied how properties of bimodules are reflected in the associated comatrix corings. In particular it is shown that separable bimodules give rise to coseparable ...

متن کامل

Comatrix Corings and Galois Comodules over firm rings

Galois corings with a group-like element [4] provide a neat framework to understand the analogies between several theories like the Faithfully Flat Descent for (noncommutative) ring extensions [26], Hopf-Galois algebra extensions [27], or noncommutative Galois algebra extensions [23, 15]. A Galois coring is isomorphic in a canonical way to the Sweedler’s canonical coring A ⊗B A associated to a ...

متن کامل

Graded Quantum Cluster Algebras of Infinite Rank as Colimits

We provide a graded and quantum version of the category of rooted cluster algebras introduced by Assem, Dupont and Schiffler and show that every graded quantum cluster algebra of infinite rank can be written as a colimit of graded quantum cluster algebras of finite rank. As an application, for each k we construct a graded quantum infinite Grassmannian admitting a cluster algebra structure, exte...

متن کامل

CONSTRUCTING INFINITE ONE - REGULAR GRAPHSAleksander

Austria Abstract A graph is said to be one-regular if its automorphism group acts regularly on the set of its arcs. A construction of an innnite family of innnite one-regular graphs of valency 4 is given. These graphs are Cayley graphs of almost abelian groups and hence of polynomial growth.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Categorical Structures

سال: 2006

ISSN: 0927-2852,1572-9095

DOI: 10.1007/s10485-006-9047-2